ack(0, y) → s(y)
ack(s(x), 0) → ack(x, s(0))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
f(s(x), y) → f(x, s(x))
f(x, s(y)) → f(y, x)
f(x, y) → ack(x, y)
ack(s(x), y) → f(x, x)
↳ QTRS
↳ DependencyPairsProof
ack(0, y) → s(y)
ack(s(x), 0) → ack(x, s(0))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
f(s(x), y) → f(x, s(x))
f(x, s(y)) → f(y, x)
f(x, y) → ack(x, y)
ack(s(x), y) → f(x, x)
ACK(s(x), 0) → ACK(x, s(0))
ACK(s(x), s(y)) → ACK(s(x), y)
F(x, s(y)) → F(y, x)
F(s(x), y) → F(x, s(x))
ACK(s(x), s(y)) → ACK(x, ack(s(x), y))
F(x, y) → ACK(x, y)
ACK(s(x), y) → F(x, x)
ack(0, y) → s(y)
ack(s(x), 0) → ack(x, s(0))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
f(s(x), y) → f(x, s(x))
f(x, s(y)) → f(y, x)
f(x, y) → ack(x, y)
ack(s(x), y) → f(x, x)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
ACK(s(x), 0) → ACK(x, s(0))
ACK(s(x), s(y)) → ACK(s(x), y)
F(x, s(y)) → F(y, x)
F(s(x), y) → F(x, s(x))
ACK(s(x), s(y)) → ACK(x, ack(s(x), y))
F(x, y) → ACK(x, y)
ACK(s(x), y) → F(x, x)
ack(0, y) → s(y)
ack(s(x), 0) → ack(x, s(0))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
f(s(x), y) → f(x, s(x))
f(x, s(y)) → f(y, x)
f(x, y) → ack(x, y)
ack(s(x), y) → f(x, x)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
ACK(s(x), 0) → ACK(x, s(0))
F(x, s(y)) → F(y, x)
F(s(x), y) → F(x, s(x))
ACK(s(x), s(y)) → ACK(x, ack(s(x), y))
ACK(s(x), y) → F(x, x)
Used ordering: Polynomial interpretation [25,35]:
ACK(s(x), s(y)) → ACK(s(x), y)
F(x, y) → ACK(x, y)
The value of delta used in the strict ordering is 1/16.
POL(f(x1, x2)) = 3/2 + (3/4)x_1 + (1/4)x_2
POL(ACK(x1, x2)) = 4 + (3/4)x_1
POL(s(x1)) = 1/4 + (4)x_1
POL(F(x1, x2)) = 4 + (3/4)x_1 + (1/2)x_2
POL(0) = 0
POL(ack(x1, x2)) = 7/2
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
ACK(s(x), s(y)) → ACK(s(x), y)
F(x, y) → ACK(x, y)
ack(0, y) → s(y)
ack(s(x), 0) → ack(x, s(0))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
f(s(x), y) → f(x, s(x))
f(x, s(y)) → f(y, x)
f(x, y) → ack(x, y)
ack(s(x), y) → f(x, x)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
ACK(s(x), s(y)) → ACK(s(x), y)
ack(0, y) → s(y)
ack(s(x), 0) → ack(x, s(0))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
f(s(x), y) → f(x, s(x))
f(x, s(y)) → f(y, x)
f(x, y) → ack(x, y)
ack(s(x), y) → f(x, x)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
ACK(s(x), s(y)) → ACK(s(x), y)
The value of delta used in the strict ordering is 4.
POL(ACK(x1, x2)) = (4)x_2
POL(s(x1)) = 1 + (4)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
ack(0, y) → s(y)
ack(s(x), 0) → ack(x, s(0))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
f(s(x), y) → f(x, s(x))
f(x, s(y)) → f(y, x)
f(x, y) → ack(x, y)
ack(s(x), y) → f(x, x)